Packing of three copies of a digraph into the transitive tournament
نویسنده
چکیده
In this paper, we show that if the number of arcs in an oriented graph −→ G (of order n) without directed cycles is sufficiently small (not greater than 2 3 n− 1), then there exist arc disjoint embeddings of three copies of −→ G into the transitive tournament TTn. It is the best possible bound.
منابع مشابه
PACKING AND DECOMPOSITIONS IN TRANSITIVE TOURNAMENTS – PhD THESIS
In this thesis we shall deal with oriented graphs. The motivation for us is a result by Sali and Simonyi (see also a short proof by Gyárfás) where the existence of the decomposition of transitive tournaments on two isomorphic graphs is shown. In this thesis we start to study a problem of packing in transitive tournaments and we consider decompositions and partitions of transitive tournaments. T...
متن کاملPartitioning Vertices of a Tournament into Independent Cycles
This article will generally follow the notation and terminology defined in [1]. A digraph is called strongly connected or strong if for every pari of vertices u and v there exists a directed path from u to v and a directed path from v to u. Let k be a positive integer. A digraph G is k-connected if the removal of any set of fewer than k vertices results in a strong digraph. A tournament with n ...
متن کاملThe number of edge-disjoint transitive triples in a tournament
We prove that a tournament with n vertices has more than 0.13n(1 + o(1)) edge-disjoint transitive triples. We also prove some results on the existence of large packings of k-vertex transitive tournaments in an n-vertex tournament. Our proofs combine probabilistic arguments and some powerful packing results due to Wilson and to Frankl and Rödl.
متن کاملStar-factors of tournaments
Let Sm denote the m-vertex simple digraph formed by m− 1 edges with a common tail. Let f(m) denote the minimum n such that every n-vertex tournament has a spanning subgraph consisting of n/m disjoint copies of Sm. We prove that m lgm−m lg lgm ≤ f(m) ≤ 4m − 6m for sufficiently large m. If D is an acyclic digraph of order n, then D occurs as a subgraph of every tournament with at least 2 vertices...
متن کاملK-colored Kernels
We study k-colored kernels in m-colored digraphs. An m-colored digraph D has k-colored kernel if there exists a subset K of its vertices such that (i) from every vertex v / ∈ K there exists an at most k-colored directed path from v to a vertex of K and (ii) for every u, v ∈ K there does not exist an at most k-colored directed path between them. In this paper, we prove that for every integer k ≥...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 24 شماره
صفحات -
تاریخ انتشار 2004